Clique problem

Results: 134



#Item
11New results for the 2-interval pattern problem Guillaume Blin1 , Guillaume Fertin1 , and Stéphane Vialette2 1 LINA, FRE CNRS 2729 Université de Nantes, 2 rue de la Houssinière

New results for the 2-interval pattern problem Guillaume Blin1 , Guillaume Fertin1 , and Stéphane Vialette2 1 LINA, FRE CNRS 2729 Université de Nantes, 2 rue de la Houssinière

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:28:57
12JMLR: Workshop and Conference Proceedings vol 40:1–40, 2015  28th Annual Conference on Learning Theory Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems

JMLR: Workshop and Conference Proceedings vol 40:1–40, 2015 28th Annual Conference on Learning Theory Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2015-07-20 20:08:36
13Approximating Visibility Problems within a Constant E. M ARKOU Computer Science, ECE, National Technical University of Athens, Greece C. F RAGOUDAKIS Computer Science, ECE, National Technical University of Athens, Greece

Approximating Visibility Problems within a Constant E. M ARKOU Computer Science, ECE, National Technical University of Athens, Greece C. F RAGOUDAKIS Computer Science, ECE, National Technical University of Athens, Greece

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:43
14Petr Mitrichev Contest 6 http://acm.sgu.ru/, Sunday, December 27, 2009 Problem A. Black-white balls Input file: Output file:

Petr Mitrichev Contest 6 http://acm.sgu.ru/, Sunday, December 27, 2009 Problem A. Black-white balls Input file: Output file:

Add to Reading List

Source URL: acm.sgu.ru

Language: English - Date: 2009-12-27 02:37:57
15Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models

Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2009-12-21 16:02:55
16CS369N: Beyond Worst-Case Analysis Lecture #4: Probabilistic and Semirandom Models for Clustering and Graph Partitioning∗ Tim Roughgarden† April 25, 2010

CS369N: Beyond Worst-Case Analysis Lecture #4: Probabilistic and Semirandom Models for Clustering and Graph Partitioning∗ Tim Roughgarden† April 25, 2010

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-09-26 19:00:24
17Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3  1

Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2012-04-30 01:44:46
18Is Holism A Problem For Inductive Inference? A Computational Analysis Maxwell A. Bertolero () Thomas L. Griffiths (tom ) Department of Psychology & Helen Wills Neuroscience Ins

Is Holism A Problem For Inductive Inference? A Computational Analysis Maxwell A. Bertolero () Thomas L. Griffiths (tom ) Department of Psychology & Helen Wills Neuroscience Ins

Add to Reading List

Source URL: cocosci.berkeley.edu

Language: English - Date: 2014-05-02 14:06:19
19JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015  Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek

JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2015-07-20 20:08:36